Repairing Boolean logical models from time-series data using Answer Set Programming
نویسندگان
چکیده
منابع مشابه
Repairing Boolean regulatory networks using Answer Set Programming
Models of biological regulatory and signalling networks are increasingly used to formally describe and understand complex biological processes. Such models are often repaired whenever new observations become available, because the model cannot generate behaviours consistent with the new observations, or because the behaviours are contradictory. This process of model repair is often manual and t...
متن کاملUsing Answer Set Programming for Solving Boolean Games
Boolean games are a framework for reasoning about the rational behaviour of agents, whose goals are formalized using propositional formulas. They offer an attractive alternative to normal-form games, because they allow for a more intuitive and more compact encoding. Unfortunately, however, there is currently no general, tailor-made method available to compute the equilibria of Boolean games. In...
متن کاملInference and Learning of Boolean Networks using Answer Set Programming
A Boolean Network is a compact mathematical representation of biological systems widely used in bioinformatics. However, in practice, experiments are usually not sufficient to infer a Boolean network which represents the whole biological system. Previous works relied on inferring and learning techniques to complete those models, or to learn new networks satisfying experimental properties repres...
متن کاملSolving Alternating Boolean Equation Systems in Answer Set Programming
In this paper we apply answer set programming to solve alternating Boolean equation systems. We develop a novel characterization of solutions for variables in disjunctive and conjunctive Boolean equation systems. Based on this we devise a mapping from Boolean equation systems with alternating fixed points to normal logic programs such that the solution of a given variable of an equation system ...
متن کاملBoolean Functions with Ordered Domains in Answer Set Programming
Boolean functions in Answer Set Programming have proven a useful modelling tool. They are usually specified by means of aggregates or external atoms. A crucial step in computing answer sets for logic programs containing Boolean functions is verifying whether partial interpretations satisfy a Boolean function for all possible values of its undefined atoms. In this paper, we develop a new methodo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms for Molecular Biology
سال: 2019
ISSN: 1748-7188
DOI: 10.1186/s13015-019-0145-8